Central limit theorems, Lee-Yang zeros, and graph-counting polynomials
نویسندگان
چکیده
Article history: Received 4 September 2014 Available online 16 March 2016
منابع مشابه
The Yang-Lee zeros of the 1D Blume-Capel model on connected and non-connected rings
We carry out a numerical and analytic analysis of the Yang-Lee zeros of the 1D Blume-Capel model with periodic boundary conditions and its generalization on Feynman diagrams for which we include sums over all connected and non-connected rings for a given number of spins. In both cases, for a specific range of the parameters, the zeros originally on the unit circle are shown to departure from it...
متن کاملYang–Lee zeros of the Yang–Lee model
To understand the distribution of the Yang–Lee zeros in quantum integrable field theories we analyse the simplest of these systems given by the 2D Yang– Lee model. The grand-canonical partition function of this quantum field theory, as a function of the fugacity z and the inverse temperature β, can be computed in terms of the thermodynamics Bethe Ansatz based on its exact S-matrix. We extract t...
متن کاملOn Counting Polynomials of Some Nanostructures
The Omega polynomial(x) was recently proposed by Diudea, based on the length of strips in given graph G. The Sadhana polynomial has been defined to evaluate the Sadhana index of a molecular graph. The PI polynomial is another molecular descriptor. In this paper we compute these three polynomials for some infinite classes of nanostructures.
متن کاملYang-Lee zeros of a random matrix model for QCD at finite density
We study the Yang-Lee zeros of a random matrix partition function with the global symmetries of the QCD partition function. We consider both zeros in the complex chemical potential plane and in the complex mass plane. In both cases we find that the zeros are located on a curve. In the thermodynamic limit, the zeros appear to merge to form a cut. The shape of this limiting curve can be obtained ...
متن کاملWeighted enumeration of spanning subgraphs with degree constraints
The Heilmann-Lieb Theorem on (univariate) matching polynomials states that the polynomial ∑ k mk(G)y k has only real nonpositive zeros, in which mk(G) is the number of k-edge matchings of a graph G. There is a stronger multivariate version of this theorem. We provide a general method by which “theorems of Heilmann-Lieb type” can be proved for a wide variety of polynomials attached to the graph ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 141 شماره
صفحات -
تاریخ انتشار 2016